Kolmogorov complexity and the second incompleteness theorem
نویسنده
چکیده
We shall prove the second incompleteness theorem via Kolmogorov complexity.
منابع مشابه
The Surprise Examination Paradox and the Second Incompleteness Theorem
Few theorems in the history of mathematics have inspired mathematicians and philosophers as much as Gödel’s incompleteness theorems. The first incompleteness theorem states that, for any rich enough consistent mathematical theory, there exists a statement that cannot be proved or disproved within the theory. The second incompleteness theorem states that for any rich enough consistent mathematic...
متن کاملConstructibility and Rosserizability of the Proofs of Boolos and Chaitin for Godel's Incompleteness Theorem
The proofs of Chaitin and Boolos for Gödel’s Incompleteness Theorem are studied from the perspectives of constructibility and Rosserizability. By Rosserization of a proof we mean that the independence of the true but unprovable sentence can be shown by assuming only the (simple) consistency of the theory. It is known that Gödel’s own proof for his incompleteness theorem is not Rosserizable, and...
متن کاملPanu Raatikainen on Interpreting Chaitin’s Incompleteness Theorem
The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin’s famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the...
متن کاملIncompleteness and Artificial Intelligence
The implications of Gödel incompleteness for artificial intelligence have been studied many times before (e.g. [8]), as has the relation between Kolmogorov complexity and incompleteness (e.g. [3, 2]). In this paper we look at the relationship between these from a new angle. We start by considering the prediction of computable sequences of bounded complexity, an ability which would be fundamenta...
متن کاملAlgorithmic Information Theory and Kolmogorov Complexity
This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), notion of randomness (Martin-Löf randomness, Mises–Church randomness), Solomonoff universal a priori probability and their properties (symmetry of information, connection between a priori probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 36 شماره
صفحات -
تاریخ انتشار 1997